Greibach Normal Form in Algebraically Complete Semirings
نویسندگان
چکیده
منابع مشابه
Greibach Normal Form in Algebraically Complete Semirings
We give inequational and equational axioms for semirings with a fixed-point operator and formally develop a fragment of the theory of context-free languages. In particular, we show that Greibach’s normal form theorem depends only on a few equational properties of least pre-fixed-points in semirings, and elimination of chainand deletion rules depend on their inequational properties (and the idem...
متن کاملGreibach Normal Form Transformation, Revisited
We develop a new method for placing a given context-free grammar into Greibach normal form with only polynomial increase of its size. Starting with an arbitrary "-free context-free grammar G, we transform G into an equivalent context-free grammar H in extended Greibach normal form; i.e., in addition to rules, fulllling the Greibach normal form properties, the grammar can have chain rules. The s...
متن کاملFrom Left-Regular to Greibach Normal Form Grammars
Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that is, a con text-free grammar where each right-hand side of a prorfuction begins with a terminal symbol and the remainder of the right-hand side consists of nonterminal symbols. In this short paper we show that for a left-regular grammar G we can obtain a right-regular grammar G’ (which is by defi...
متن کاملA Local Greibach Normal Form for Hyperedge Replacement Grammars
Heap-based data structures play an important role in modern programming concepts. However standard verification algorithms cannot cope with infinite state spaces as induced by these structures. A common approach to solve this problem is to apply abstraction techniques. Hyperedge replacement grammars provide a promising technique for heap abstraction as their production rules can be used to part...
متن کاملAn Elementary Proof of Double Greibach Normal Form
In [1,6,7] elementary proofs are given of Greibach Normal Form of context-free grammars [4]. Here we do the same for Double Greibach Normal Form, where it is required that each right-hand side of a production both starts and ends with a terminal symbol [5]. In [5], first a grammar in Greibach Normal Form is constructed, which is then transformed into Double Greibach Normal Form; both transforma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 2002
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v9i46.21761